Corelab Seminar
2008-2009
Evangelos Bampas (NTUA)
Routing and wavelength assignment in optical networks
Abstract. We study various models for routing and wavelength assignment in all-optical networks with wavelength division multiplexing.
We suggest novel algorithms for the problem of routing and wavelength assignment in WDM rings, under the following assumptions:
- requests are not pre-routed and not weighted,
- requests are pre-routed and not weighted,
- requests are pre-routed and weighted.
In each case, we provide theoretical guarantees for the approximation ratio and the running time of our algorithms and we compare them experimentally with already known algorithms. These comparisons lead to interesting conclusions that may be useful from a practical point of view.
Furthermore, we study a selfish model for wavelength assignment in multifiber all-optical networks. We end up with results of Nash equilibria existence and give tight bounds for the price of anarchy. Especially regarding the ring topology, we are able to prove that the price of anarchy is bounded by a constant, provided that the network load is large enough compared to the number of available wavelengths (which is a perfectly realistic assumption for most practical settings).
(based on joint work with Aris Pagourtzis, Katerina Potika, and George Pierrakos)